Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
391	Complete Functional Synthesis Viktor Kuncak Mika¨el Mayer Ruzica Piskac Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-04-01 07:52:40 Model theory Logic in computer science Predicate logic Semantics NP-complete problems Satisfiability Modulo Theories Function First-order logic Quantifier elimination Mathematics Mathematical logic Logic
392	Integrality Gaps for Sherali–Adams Relaxations Moses Charikar∗ Princeton University Konstantin Makarychev IBM T.J. Watson Research Center Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:40 NP-complete problems Connectivity Vertex cover Linear programming relaxation Tree Graph SL Regular graph Graph theory Theoretical computer science Mathematics
393	Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:22 NP-complete problems Analysis of algorithms Graph coloring Graph theory Time complexity Boolean satisfiability problem Randomized algorithm MAXEkSAT One-in-three 3SAT Theoretical computer science Computational complexity theory Mathematics
394	JOINT SPECTRAL RADIUS AND PATH-COMPLETE GRAPH LYAPUNOV FUNCTIONS∗ ¨ JUNGERS, AMIR ALI AHMADI, RAPHAEL PABLO A. PARRILO, AND MARDAVIJ ROOZBEHANI† Abstract. We introduce the framework of path-complete graph Lyapunov f Add to Reading List Source URL: web.mit.edu Language: English - Date: 2013-08-19 00:17:00 Theoretical computer science Dynamical systems Control theory Lyapunov stability Lyapunov function Joint spectral radius Semidefinite programming Graph labeling Graph Graph theory Mathematics Stability theory
395	PDF Document Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-17 12:02:13 NP-complete problems Graph coloring Tree Clique Maximal independent set Graph Connectivity Connected component Independent set Graph theory Mathematics Theoretical computer science
396	Distribution of forcing and anti-forcing numbers of random perfect matchings on hexagonal chains and crowns Hsien-Kuei Hwanga , Hongchuan Leib, Yeong-Nan Yehc , Heping Zhangd a Institute Add to Reading List Source URL: 140.109.74.92 Language: English - Date: 2015-01-21 18:54:09 NP-complete problems Combinatorial optimization Matching Graph coloring Forcing Hexagon Recurrence relation Dominating set Mathematics Theoretical computer science Graph theory
397	Attachment Parenting International Research Group(A) Position Paper Summary. Infant Sleep Safety What the Research Tells Us Attachment Parenting International strives to ensure parents have access to the most complete in Add to Reading List Source URL: www.attachmentparenting.org Language: English - Date: 2013-12-20 14:23:18 Behavior Parenting Breastfeeding Sleep Co-sleeping Attachment parenting Infant Back to Sleep Attachment theory Human development Childhood Infancy
398	Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2006-11-19 23:12:18 Complexity classes Circuit complexity Computability theory Mathematical optimization FO NP-complete P versus NP problem Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
399	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
400	ICS 161 — Algorithms — Winter 1998 — Second Midterm Name: ID: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-11-13 18:59:53 Spanning tree NP-complete problems Combinatorial optimization Operations research Minimum spanning tree Routing algorithms Algorithm Matching Dynamic programming Mathematics Theoretical computer science Graph theory

UPDATE